Heuristic Classification of an Intransitively Ordered Set
نویسندگان
چکیده
منابع مشابه
Extension of Preferences to an Ordered Set
If a decision maker prefers x to y to z, would he choose orderd set [x, z] or [y, x]? This article studies extension of preferences over individual alternatives to an ordered set which is prevalent in closed ballot elections with proportional representation and other real life problems where the decision maker is to choose from groups with an associated hierarchy inside. I introduce five ordina...
متن کاملSampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملHeuristic Classification
A broad range of well-structured problems--embracing forms of diagnosis, catalog selection, and skeletal planning--are solved in 'expert systems" by the methods of heuristic classification. These programs have a characteristic inference structure that systematically relates data to a pre-enumerated set of solutions by abstraction, heuristic association, and refinement. In contrast with previous...
متن کاملVariational Skinning of an Ordered Set of Discrete 2D Balls
This paper considers the problem of computing an interpolating skin of a ordered set of discrete 2D balls. By construction, the skin is constrained to be C continuous, and for each ball, it touches the ball at a point and is tangent to the ball at the point of contact. Using an energy formulation, we derive differential equations that are designed to minimize the skin’s arc length, curvature, o...
متن کاملThe Number of Depth - First Searches of an Ordered Set
We show that the problems of deciding whether an ordered set has at least k depth-first linear extensions and whether an ordered set has at least k greedy linear extensions are NP-hard. AMS subject chssi6catiom (1980). 06A10, 68C25.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1983
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.19.144